Jozef Skokan Ramsey - goodness - and otherwise

نویسندگان

  • Peter Allen
  • Graham Brightwell
  • Jozef Skokan
چکیده

A celebrated result of Chvátal, Rödl, Szemerédi and Trotter states (in slightly weakened form) that, for every natural number ∆, there is a constant r∆ such that, for any connected n-vertex graph G with maximum degree ∆, the Ramsey number R(G,G) is at most r∆n, provided n is sufficiently large. In 1987, Burr made a strong conjecture implying that one may take r∆ = ∆. However, Graham, Rödl and Ruciński showed, by taking G to be a suitable expander graph, that necessarily r∆ > 2 c∆ for some constant c > 0. We show that the use of expanders is essential: if we impose the additional restriction that the bandwidth of G be at most some function β(n) = o(n), then R(G,G) ≤ (2χ(G) + 4)n ≤ (2∆ + 6)n, i.e., r∆ = 2∆ + 6 suffices. On the other hand, we show that Burr’s conjecture itself fails even for P k n , the kth power of a path Pn. Brandt showed that for any c, if ∆ is sufficiently large, there are connected nvertex graphs G with ∆(G) ≤ ∆ but R(G,K3) > cn. We show that, given ∆ and H, there are β > 0 and n0 such that, if G is a connected graph on n ≥ n0 vertices with maximum degree at most ∆ and bandwidth at most βn, then we have R(G,H) = (χ(H) − 1)(n − 1) + σ(H), where σ(H) is the smallest size of any part in any χ(H)partition of H. We also show that the same conclusion holds without any restriction on the maximum degree of G if the bandwidth of G is at most ε(H) log n/ log logn.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Ramsey number of the clique and the hypercube

Ramsey theory, basics r(n, s): smallest N such that any colouring of the edges of K N with blue and red contains a blue clique on n vertices or a red clique on s vertices

متن کامل

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

Let C (3) n denote the 3-uniform tight cycle, that is the hypergraph with vertices v1, . . . , vn and edges v1v2v3, v2v3v4, . . . , vn−1vnv1, vnv1v2. We prove that the smallest integer N = N(n) for which every red-blue coloring of the edges of the complete 3-uniform hypergraph with N vertices contains a monochromatic copy of C (3) n is asymptotically equal to 4n/3 if n is divisible by 3, and 2n...

متن کامل

Ramsey Numbers of Squares of Paths

The Ramsey number R(G,H) has been actively studied for the past 40 years, and it was determined for a large family of pairs (G,H) of graphs. The Ramsey number of paths was determined very early on, but surprisingly very little is known about the Ramsey number for the powers of paths. The r-th power P r n of a path on n vertices is obtained by joining any two vertices with distance at most r. We...

متن کامل

On the Ramsey number of the triangle and the cube

The Ramsey number r(K3, Qn) is the smallest integer N such that every redblue colouring of the edges of the complete graph KN contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erdős conjectured that r(K3, Qn) = 2 n+1 − 1 for every n ∈ N, but the first non-trivial upper bound was obtained only recently, by Conlon, Fox, Lee and Sudakov, who prove...

متن کامل

Cycles Are Strongly Ramsey-Unsaturated

We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H. This notion was introduced by Balister, Lehel and Schelp in [2], where it is shown that cycles (except for C4) are Ramsey-unsaturated, and conjectured that, moreover, one may add any chord without changing the Ramsey number of the cycle Cn, u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014